Provable-security analysis of authenticated encryption in Kerberos

Provable-Security Analysis of Authenticated Encryption in Kerberos∗

Kerberos is a widely-deployed network authentication protocol that is being considered for standardization. Many works have analyzed its security, identifying flaws and often suggesting fixes, thus helping the protocol’s evolution. Several recent results present successful formalmethods-based verification of a significant portion of the current version 5, and some even imply security in the com...

Improved convertible authenticated encryption scheme with provable security

Article history: Received 26 August 2010 Received in revised form 22 November 2010 Accepted 25 March 2011 Available online 14 April 2011 Communicated by L. Viganò

Provable security support for kerberos (and beyond)

Deterministic Authenticated-Encryption: A Provable-Security Treatment of the Key-Wrap Problem

Standards bodies have been addressing the key-wrap problem, a cryptographic goal that has never received a provable-security treatment. In response, we provide one, giving definitions, constructions, and proofs. We suggest that key-wrap’s goal is security in the sense of deterministic authenticated-encryption (DAE), a notion that we put forward. We also provide an alternative notion, a pseudora...

Limits of Provable Security for Homomorphic Encryption

We show that public-key bit encryption schemes which support weak (i.e., compact) homomorphic evaluation of any sufficiently “sensitive” collection of functions cannot be proved message indistinguishable beyond AM ∩ coAM via general (adaptive) reductions, and beyond statistical zero-knowledge via reductions of constant query complexity. Examples of sensitive collections include parities, majori...